Algorithms for Perfectly Contractile Graphs
نویسندگان
چکیده
منابع مشابه
Algorithms for perfectly contractile graphs
We consider the class A of graphs that contain no odd hole, no antihole of length at least 5, and no “prism” (a graph consisting of two disjoint triangles with three disjoint paths between them) and the class A′ of graphs that contain no odd hole, no antihole of length at least 5, and no odd prism (prism whose three paths are odd). These two classes were introduced by Everett and Reed and are r...
متن کاملPerfectly contractile diamond-free graphs
Irena Rusu Universit e d'Orl eans, L.I.F.O., B.P. 6759, 45067 Orl eans Cedex 2, France Abstract Everett et al. [2] conjectured that a graph with no odd hole and no stretcher is perfectly contractile, i.e. it can be reduced to a clique by successively contracting even pairs. We show that this conjecture is true for diamond-free graphs, and propose a polynomial algorithm to perform the successive...
متن کاملA class of perfectly contractile graphs
We consider the class A of graphs that contain no odd hole, no antihole, and no “prism” (a graph consisting of two disjoint triangles with three disjoint paths between them). We prove that every graph G ∈ A different from a clique has an “even pair” (two vertices that are not joined by a chordless path of odd length), as conjectured by Everett and Reed [see the chapter “Even pairs” in the book ...
متن کاملMETA-HEURISTIC ALGORITHMS FOR MINIMIZING THE NUMBER OF CROSSING OF COMPLETE GRAPHS AND COMPLETE BIPARTITE GRAPHS
The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...
متن کاملA charming class of perfectly orderable graphs
Hoang, C.T., F. Maffray, S. Olariu and M. Preissmann, A charming class of perfectly orderable graphs, Discrete Mathematics 102 (1992) 67-74. We investigate the following conjecture of VaSek Chvatal: any weakly triangulated graph containing no induced path on five vertices is perfectly orderable. In the process we define a new polynomially recognizable class of perfectly orderable graphs called ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2005
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480104442522